A Finite Element Method on Convex Polyhedra
نویسندگان
چکیده
We present a method for animating deformable objects using a novel finite element discretization on convex polyhedra. Our finite element approach draws upon recently introduced 3D mean value coordinates to define smooth interpolants within the elements. The mathematical properties of our basis functions guarantee convergence. Our method is a natural extension to linear interpolants on tetrahedra: for tetrahedral elements, the methods are identical. For fast and robust computations, we use an elasticity model based on Cauchy strain and stiffness warping. This more flexible discretization is particularly useful for simulations that involve topological changes, such as cutting or fracture. Since splitting convex elements along a plane produces convex elements, remeshing or subdivision schemes used in simulations based on tetrahedra are not necessary, leading to less elements after such operations. We propose various operators for cutting the polyhedral discretization. Our method can handle arbitrary cut trajectories, and there is no limit on how often elements can be split.
منابع مشابه
Pointwise error estimates of finite element approximations to the Stokes problem on convex polyhedra
The aim of the paper is to show the stability of the finite element solution for the Stokes system in W 1 ∞ norm on general convex polyhedral domain. In contrast to previously known results, W 2 r regularity for r > 3, which does not hold for a general convex polyhedral domains, is not required. The argument uses recently available sharp Hölder pointwise estimates of the corresponding Green’s m...
متن کاملHULK - Simple and fast generation of structured hexahedral meshes for improved subsurface simulations
Short for Hexahedra from Unique Location in (K)convex Polyhedra – HULK is a simple and efficient algorithm to generate hexahedral meshes from generic STL files describing a geological model to be used in simulation tools based on the finite difference, finite volume or finite element methods. Using binary space partitioning of the input geometry and octree refinement on the grid, a successive i...
متن کاملOptimality of a Gradient Bound for Polyhedral Wachspress Coordinates
In a recent paper with Gillette and Sukumar an upper bound was derived for the gradients of Wachspress barycentric coordinates in simple convex polyhedra. This bound provides a shape-regularity condition that guarantees the convergence of the associated polyhedral finite element method for second order elliptic problems. In this paper we prove the optimality of the bound using a family of hexah...
متن کاملMax-Norm Stability of Low Order Taylor-Hood Elements in Three Dimensions
We prove stability in W 1,∞(Ω) and L∞(Ω) for the velocity and pressure approximations, respectively, using the lowest-order Taylor-Hood finite element spaces to solve the three dimensional Stokes problem. The domain Ω is assumed to be a convex polyhedra.
متن کاملConstruction of Scalar and Vector Finite Element Families on Polygonal and Polyhedral Meshes
We combine theoretical results from polytope domain meshing, generalized barycentric coordinates, and finite element exterior calculus to construct scalar- and vector-valued basis functions for conforming finite element methods on generic convex polytope meshes in dimensions 2 and 3. Our construction recovers well-known bases for the lowest order Nédélec, Raviart-Thomas, and Brezzi-Douglas-Mari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Graph. Forum
دوره 26 شماره
صفحات -
تاریخ انتشار 2007